Implementación del algoritmo MBS para resolver instancias de bin packing

The Minimum Bin Slack is a heuristic proposed by Gupta and Ho [6]. Such algorithm is defined by its authors as an algorithm focused on the container. MBS starts from the idea that minimizing the number of containers is equivalent to reduce the left space in the containers: thus, less quantity of containers means less left space in the containers. Considering this idea, MBS algorithm uses the concept of lexicographic search in order to fill each container, searching to optimize space in container and once it is filled, proceed to fill the next one, without forgetting the goal of reducing the space behind. In this article, a proposal is presented to implement this algorithm and the results obtained from it are compared to results obtained from FFD. Finally, the results of this comparison are presented.